๐Ÿฟ๏ธ ScourBrowse
LoginSign Up
You are offline. Trying to reconnect...
Copied to clipboard
Unable to share or copy to clipboard
๐Ÿ”— Topological Sorting

Dependency Resolution, Build Systems, Package Management, Graph Algorithms

NaviAgent: Bilevel Planning on Tool Dependency Graphs for Function Calling
arxiv.orgยท10h
โšกEffectful Programming
Slashing CI Costs at Uber
uber.comยท4hยท
Discuss: Hacker News
๐Ÿ”„Reproducible Builds
Build It Clean: Large-Scale Detection of Code Smells in Build Scripts
arxiv.orgยท1d
๐Ÿ”„Reproducible Builds
Diving deep into Binius M3 arithmetization using Merkle tree inclusion as an example
blog.lambdaclass.comยท1d
๐ŸŒณArchive Merkle Trees
๐Ÿง  Solving LeetCode Until I Become Top 1% โ€” Day `30`
dev.toยท6hยท
Discuss: DEV
๐Ÿ“Error Bounds
Kumo Surfaces Structured Data Patterns Generative AI Misses
thenewstack.ioยท33m
๐Ÿ“ŠGraph Databases
The Interactive Handbook on Data Structures and Algorithms
cartesian.appยท1dยท
Discuss: Lobsters, Hacker News, Hacker News
๐ŸŒณTrie Structures
HariSekhon/DevOps-Bash-tools
github.comยท12h
๐ŸšShell Automation
New: Improve Apache Iceberg query performance in Amazon S3 with sort and z-order compaction
aws.amazon.comยท18h
๐Ÿ”„Burrows-Wheeler
Lessons from LangChain and Slack and MCP Integration
medium.comยท17hยท
Discuss: Hacker News
โœจEffect Handlers
Ratcheting to zero: How incremental constraints eliminate technical debt
testdouble.comยท1d
โšกIncremental Computation
Replacing Client-side JavaScript SDKs with WebAssembly Components at the Edge
fastly.comยท1d
๐Ÿ•ธ๏ธWebAssembly
Shane Kennedy - Software Engineer
shaneikennedy.xyzยท1d
๐Ÿฆ€Rust Macros
The Product Topology, or, How Not to Stumble into the Box Topology
relatedwork.blogspot.comยท2dยท
Discuss: relatedwork.blogspot.com
๐Ÿ—๏ธConstructive Mathematics
Greedy Is Good. Less Greedy May Be Better
gojiberries.ioยท13hยท
Discuss: Hacker News
๐ŸงฎKolmogorov Complexity
Make Sense of a 10K+ Line GitHub Repos Without Reading the Code
kdnuggets.comยท22h
๐ŸŒฟgit
Computing Betti tables and minimal presentations of zero-dimensional persistent homology
arxiv.orgยท1d
๐Ÿ•ธ๏ธAlgebraic Topology
The most efficient algorithm for detecting claws in general graphs, with a runtime of O(m ฮ”) โ€” where m is the number of edges and ฮ” is the maximum degree โ€” is n...
dev.toยท21hยท
Discuss: DEV
๐Ÿ•ธ๏ธGraph Algorithms
Beyond Frameworks: How Computer Science Fundamentals Forge the Complete Developer
dev.toยท33mยท
Discuss: DEV
๐Ÿ“Code Metrics
Counting with Categories (Part 3)
golem.ph.utexas.eduยท22h
ฮปLambda Formalization
Loading...Loading more...
AboutBlogChangelogRoadmap